Generalized Knapsack problems and fixed degree separations
نویسندگان
چکیده
منابع مشابه
Monotone separations for constant degree
We prove a separation between monotone and general arithmetic formulas for polynomials of constant degree. We give an example of a polynomial C in n variables and degree k which is computable by an arithmetic formula of size O(k2n2), but every monotone formula computing C requires size (n/kc)Ω(log k), with c ∈ (0, 1). This also gives a separation between monotone and homogeneous formulas, for p...
متن کاملApproximating fixed points for nonexpansive mappings and generalized mixed equilibrium problems in Banach spaces
We introduce a new iterative scheme for nding a common elementof the solutions set of a generalized mixed equilibrium problem and the xedpoints set of an innitely countable family of nonexpansive mappings in a Banachspace setting. Strong convergence theorems of the proposed iterative scheme arealso established by the generalized projection method. Our results generalize thecorresponding results...
متن کاملOn variational inequality, fixed point and generalized mixed equilibrium problems
*Correspondence: [email protected] 1School of Information Engineering, North China University of Water Resources and Electric Power, Zhengzhou, Henan 450011, China Full list of author information is available at the end of the article Abstract In this article, variational inequality, fixed point, and generalized mixed equilibrium problems are investigated based on an extragradient iterative algor...
متن کاملMonotone variational inequalities, generalized equilibrium problems and fixed point methods
In this paper, we study monotone variational inequalities and generalized equilibrium problems. Weak convergence theorems are established based on a fixed point method in the framework of Hilbert spaces.
متن کاملMulti-dimensional Knapsack Problems
This chapter reviews our recent work on applying hybrid collaborative techniques that integrate Branch and Bound (B&B) and Memetic Algorithms (MAs) in order design effective heuristics for the Multidimensional Knapsack Problem (MKP). To this end, let us recall that Branch and Bound (B&B) [1] is an exact algorithm for finding optimal solutions to combinatorial problems, that, basically works by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/0304-3975(96)00002-3